A matrix algebra approach to approximate Hessians

نویسندگان

چکیده

Abstract This work presents a novel matrix-based method for constructing an approximation Hessian using only function evaluations. The requires less computational power than interpolation-based methods and is easy to implement in programming languages such as MATLAB. As evaluations are required, the suitable use derivative-free algorithms. For reasonably structured sample sets, proven create order-$1$ accurate of full Hessian. Under more specialized structures, proved yield order-$2$ accuracy. underdetermined case, where number points fewer required interpolation, studied error bounds developed resulting partial Hessians.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A combinatorial approach to matrix algebra

"The theory of correspondence reaches far deeper than that of mere numerical congruity with which it is associated as the substance with the shadow"

متن کامل

A matrix algebra approach to tree shape

In this paper we investigate eigenvalues of matrix representations of trees as a means by which one might quantify the shape of a tree. We consider the adjacency matrix, the Laplacian matrix, and the pairwise distance matrix of the tree. We then demonstrate that for any of these choices of matrix the fraction of trees with a unique set of eigenvalues goes to zero as the number of leaves goes to...

متن کامل

A Combinatorial Approach to Matrix Algebra

To most contemporary mathematicians matrices and linear transformations are practically interchangeable notions . Indeed, the mainstream 'Bourbakian' establishment, with its profound disdain of the concrete, goes as far as to frown at the mere mention of the word 'matrix'. To me, however, (as well as to a growing number of mathematical dissidents c~lled 'combinatorialists') a matrix has nothing...

متن کامل

A unifying approach to abstract matrix algebra preconditioning

In earlier papers Tyrtyshnikov 42] and the rst author 14] considered the analysis of clustering properties of the spectra of speciic Toeplitz preconditioned matrices obtained by means of the best known matrix algebras. Here we generalize this technique to a generic Banach algebra of matrices by devising general preconditioners related to \convergent" approximation processes 36]. Finally, as cas...

متن کامل

Minimal Approximate Hessians for Continuously Gâteaux Differentiable Functions

In this paper, we investigate minimal (weak) approximate Hessians, and completely answer the open questions raised by V. Jeyakumar and X. Q. Yang. As applications, we first give a generalised Taylor’s expansion in terms of a minimal weak approximate Hessian. Then we characterise the convexity of a continuously Gâteaux differentiable function. Finally some necessary and sufficient optimality con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ima Journal of Numerical Analysis

سال: 2023

ISSN: ['1464-3642', '0272-4979']

DOI: https://doi.org/10.1093/imanum/drad056